package _17_剑指Offer;

public class _42_剑指Offer连续子数组的最大和 {

    public static void main(String[] args) {
        _42_剑指Offer连续子数组的最大和 v = new _42_剑指Offer连续子数组的最大和();
        int[] ins = new int[]{-2, 1, -3, 4, -1, 2, 1, -5, 4};

        System.out.println(v.maxSubArray(ins));
    }

    public int maxSubArray(int[] nums) {

        int[] dp = new int[nums.length];
        dp[0] = nums[0];
        int max = dp[0];
        for (int i = 1; i < nums.length; i++) {
            if (dp[i - 1] > 0) {
                dp[i] = dp[i - 1] + nums[i];
            } else {
                dp[i] = nums[i];
            }
            max = Math.max(max, dp[i]);
        }
        return max;
    }

}
